n = int(input())
diff = list(map(int,input().split()))
nums = [1]
for i in diff:
nums.append(nums[-1]+i)
mini = min(nums)
extra = 0
if mini<=0:
extra = (-1)*mini + 1
for i in range(len(nums)):
nums[i]+=extra
result = [i for i in range(1,n+1)]
if sorted(nums)==result:
print(*nums)
else:
print(-1)#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector <int> vi;
typedef pair <int, int> pii;
#define PB push_back
void solve () {
int n;
cin >> n;
int maxi = 0, current = 0;
vi diff;
for (int i = 0; i < n - 1; i ++) {
int q;
cin >> q;
diff.PB (q);
current += q;
maxi = max (maxi, current);
}
int num = n - maxi;
vi array, ref;
array.PB (num);
ref.PB (num);
for (int i = 0; i < n - 1; i ++) {
num += diff [i];
array.PB (num);
ref.PB (num);
}
sort (ref.begin (), ref.end ());
for (int i = 0; i < n; i ++) {
if (ref [i] != i + 1) {
cout << "-1\n";
return;
}
}
for (int i = 0; i < n; i ++) {
if (i == n - 1) cout << array [i] << "\n";
else cout << array [i] << " ";
}
}
int main () {
ios_base :: sync_with_stdio (0);
cin.tie (0);
solve ();
return 0;
} 1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |